On the complexity of constructing Golomb Rulers
نویسندگان
چکیده
AGolombRuler is a rulerwith integermarkswhere the distances between every twomarks are distinct. Golomb Rulers find diverse applications in computer science and electrical engineering. According to our knowledge the computational complexity of problems related to the construction of Golomb Rulers is unknown. We provide natural definitions for problems related to the construction of such rulers. The main contribution of this work is NP-completeness results for two such decision problems. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Algorithmic Aspects of Golomb Ruler Construction
We consider Golomb rulers and their construction. Common rulers feature marks at every unit measure, distances can often be measured with numerous pairs of marks. On Golomb rulers, for every distance there are at most two marks measuring it. The construction of optimal—with respect to shortest length for given number of marks or maximum number of marks for given length—is nontrivial, various pr...
متن کاملA review of the available construction methods for Golomb rulers
We collect the main construction methods for Golomb rulers available in the literature along with their proofs. In particular, we demonstrate that the Bose-Chowla method yields Golomb rulers that appear as the main diagonal of a special subfamily of Golomb Costas arrays. We also show that Golomb rulers can be composed to yield longer Golomb rulers.
متن کاملConstructing Optimal Golomb Rulers in Parallel
In this paper, a construction of the Golomb optimal rulers is studied with a tree search approach. Improvements to the basic algorithm are given and it is parallelized using a shared memory. The application associated to this approach is written in C using the standard OpenMP and MPI libraries. The algorithm takes advantage of a collaboration mechanism between the processors. Different load bal...
متن کاملOn the Design of Optimum Order 2 Golomb Ruler
A Golomb ruler with M marks can be defined as a set {ai} of integers so that all differences δij = aj − ai, i 6= j, are distinct. An order 2 Golomb ruler is a Golomb ruler such that all differences δijk` = |δk` − δij |, {i, j} 6 = {k, `}, are distinct as much as possible. Contruction of optimum order 2 Golomb ruler, i.e., of rulers of minimum length, is a highly combinatorial problem which has ...
متن کاملEnumeration of Golomb Rulers and Acyclic Orientations of Mixed Graphs
A Golomb ruler is a sequence of distinct integers (the markings of the ruler) whose pairwise differences are distinct. Golomb rulers, also known as Sidon sets and B2 sets, can be traced back to additive number theory in the 1930s and have attracted recent research activities on existence problems, such as the search for optimal Golomb rulers (those of minimal length given a fixed number of mark...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009